Type inference, abstract interpretation and strictness analysis
نویسندگان
چکیده
منابع مشابه
Type Inference, Abstract Interpretation and Strictness Analysis
Coppo, M. and A. Ferrari, Type inference, abstract interpretation and strictness analysis, Theoretical Computer Science 121 (1993) 113-143. Filter domains (Coppo et al., 1984) can be seen as abstract domains for the interpretation of (functional) type-free programming languages. What is remarkable is the fact that in filter domains the interpretation of a term is given by the set of its types i...
متن کاملBinding-Time Analysis and Strictness Analysis by Abstract Interpretation
Given a description of inputs and parameters in a program, a Binding-Time Analysis determines parts of a program which can be evaluated at compile-time. A Strictness Analysis determines parts of a program, whose early evaluation does not change the value of the result. In this paper , we present an analysis which subsumes both analyses for a rst-order functional language. The analysis is formul...
متن کاملBinding-time Analysis: Abstract Interpretation versus Type Inference
Interpretation versus Type Inference Jens Palsberg Michael I. Schwartzbach [email protected] [email protected] Computer Science Department, Aarhus University Ny Munkegade, DK–8000 Aarhus C, Denmark
متن کاملStrictness, totality, and non-standard-type inference
In this paper we present two non-standard-type inference systems for conjunctive strictness and totality analyses of higher-order-typed functional programs and prove completeness results for both the strictness and the totality-type entailment relations. We also study the interactions between strictness and totality analyses, showing that the information obtainable by a system that combines the...
متن کامل15-851 Project Report: Refinement Type Inference using Abstract Interpretation
Typing checking is an efficient way to catch simple errors. Refinement types [3] are invented to take advantage of type systems in specifying more program properties and verifying them through type checking. In [3, 2], a method to use rectype declaration has been proposed to specify regular tree grammar based invariants. Datatype lattices are then derived from rectype declarations. An algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90086-9